منابع مشابه
The Weighted Proportional Allocation Mechanism
We consider a resource allocation problem where providers have general convex constraints on the allocations that they can distribute to users. This type of problems has many applications in computer science, from sharing network bandwidth to scheduling jobs in data centers and distributing click-through resources in sponsored search. We introduce the weighted proportional sharing mechanism, wh...
متن کاملStateless Proportional Bandwidth Allocation
This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during co...
متن کاملProportional Allocation in Integers
3. R. R. Hall. "On the Probability that n and f(n) Are Relatively Prime III." Acta. Arith. 20 (1972):267-289. 4. G. H. Hardy & E. M. Wright. An Introduction to the Theory of Numbers. 4th ed. Oxford: Clarendon Press, 1960. 5. M. Kac. "Probability Methods in Some Problems of Analysis and Number Theory." Bull. Amer. Math. Soc. 55 (1949):641-665. 6. A. Selberg. "Note on a Paper by L. G. Sathe." J. ...
متن کاملCooperative and Weighted Proportional Cache Allocation for EPC and C-RAN
The demand for multimedia services in mobile networks continues to increase rapidly, and this increase is expected to continue in the coming years. However, the existing mobile network cannot practically deal with this explosive growth of mobile data traffic. To address this challenge, caching in Cloud Radio Access Network (C-RAN) has been proposed, where the contents can be cached at Base Band...
متن کاملProportional Representation as Resource Allocation: Approximability Results
We model Monroe’s and Chamberlin and Courant’s multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (these variants correspond to optimizing total voter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2011
ISSN: 0163-5999
DOI: 10.1145/2007116.2007132